A Decidable Probability Logic for Timed and Untimed Probabilistic Systems
نویسندگان
چکیده
In this paper we extend the predicate logic introduced in [BRS02] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to Semi-Markov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering also predicates on clock. We prove that results on Semi Markov Processes are extendible to Probabilistic Timed Automata for both the two semantics considered. Moreover, we prove that results for Markov Processes shown in [BRS02] are extendible to Probabilistic Timed Automata where urgent semantics is considered.
منابع مشابه
A Decidable Probability Logic for Timed Probabilistic Systems
In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to SemiMarkov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering als...
متن کاملSymbolic Computation of Minimal Probabilistic Reachability∗
This paper continues our study of the verification problem for infinitestate systems featuring both nondeterministic and probabilistic choice. In an earlier paper we defined symbolic probabilistic systems, an extension of the framework of symbolic transition systems due to Henzinger et. al., and considered the problem of deciding the maximal probability of reaching a set of target states. A sym...
متن کاملPCTL model checking of symbolic probabilistic systems ∗
Probabilistic model checking is a method for automatically verifying that a probabilistic system satisfies a property with a given likelihood, with the probabilistic temporal logic Pctl being a common choice for the property specification language. In this paper, we explore methods for model checking Pctl properties of infinite-state systems in which probabilistic and nondeterministic behaviour...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملProbabilistic Simulations for Probabilistic Processes
Several probabilistic simulation relations for probabilistic systems are deened and evaluated according to two criteria: compositionality and preservation of \interesting" properties. Here, the interesting properties of a system are identiied with those that are expressible in an untimed version of the Timed Probabilistic concurrent Computation Tree Logic (TPCTL) of Hansson. The definitions are...
متن کامل